Counting or Producing All Fixed Cardinality Transversals
نویسندگان
چکیده
منابع مشابه
Output-Polynomial Enumeration of All Fixed-Cardinality Ideals of a Poset, Respectively All Fixed-Cardinality Subtrees of a Tree
The N cardinality k ideals of any w-element poset (w, k variable) can be enumerated in time O(Nw). The corresponding bound for k-element subtrees of a w-element tree is O(Nw).
متن کاملCardinality, Counting, and Equinumerosity
Frege, famously, held that there is a close connection between our concept of cardinal number and the notion of one-one correspondence, a connection enshrined in Hume’s Principle. Husserl, and later Parsons, objected that there is no such close connection, that our most primitive conception of cardinality arises from our grasp of the practice of counting. Some empirical work on children’s devel...
متن کاملLatin Squares: Transversals and counting of Latin squares
Author: Jenny Zhang First, let’s preview what mutually orthogonal Latin squares are. Two Latin squares L1 = [aij ] and L2 = [bij ] on symbols {1, 2, ...n}, are said to be orthogonal if every ordered pair of symbols occurs exactly once among the n2 pairs (aij , bij), 1 ≤ i ≤ n, 1 ≤ j ≤ n. Now, let me introduce a related concept which is called transversal. A transversal of a Latin square is a se...
متن کاملCounting Fixed-Length Permutation Patterns
We consider the problem of packing fixed-length patterns into a permutation, and develop a connection between the number of large patterns and the number of bonds in a permutation. Improving upon a result of Kaplansky and Wolfowitz, we obtain exact values for the expectation and variance for the number of large patterns in a random permutation. Finally, we are able to generalize the idea of bon...
متن کاملCounting Fixed-Height Tatami Tilings
A tatami tiling is an arrangement of 1 × 2 dominoes (or mats) in a rectangle with m rows and n columns, subject to the constraint that no four corners meet at a point. For fixed m we present and use Dean Hickerson’s combinatorial decomposition of the set of tatami tilings — a decomposition that allows them to be viewed as certain classes of restricted compositions when n ≥ m. Using this decompo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2012
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-012-9716-5